dual problem
英 [ˈdjuːəl ˈprɒbləm]
美 [ˈduːəl ˈprɑːbləm]
对偶问题
双语例句
- Then, the approximately linear SVM is obtained by solving the dual problem of maximal margin method.
然后再通过求解最大间隔法的对偶问题，得到基于相似压缩的近似线性SVM。 - Lagrangian Dual Problem in Linear Vector Optimization of Set-Value Constraint
集值约束的线性向量优化中的拉格朗日对偶问题 - In Chapter six we consider the dual problem, develop several computational procedures based on duality, and discuss sensitivity and parametric analysis.
在第六章中，我们考虑对偶问题，基于对偶建立几个计算程序，并讨论了参数和灵敏度分析。 - Lagrange dual problem of second-order cone programming and its 2-dimentional primal-dual simplex method
二阶锥规划的Lagrange对偶及2维原始对偶单纯形法 - They face the dual problem of highly vulnerable populations and limited resources to respond the pandemic.
它们既存在人口高度脆弱问题，又面临大流行疫情应对资源有限问题。 - This paper analyzes the relation between the generalized moment problem and its dual problem, and gives the solution to some generalized moment problems.
分析了广义矩问题及其对偶问题的关系，获得了求解广义矩问题的方法。 - A dual problem for semi-infinite programming
半无限规划的一个对偶问题 - In the second chapter, this problem is converted into a dual problem, i.e. unconstrained maximization problem.
第二章把原规划转化为一个对偶问题，即无约束极大化问题，推广和证明了这个对偶问题的一些性质和基本定理。 - This Paper prove that Kuhn-Tucker Condition of linear programming imply its dual problem, and explain the significance of Lagrange multiplier.
证明了线性规划的Kuhn-Tucker条件蕴含着它的对偶问题，解释了Lagrange乘子的意义。 - In this paper we establish a class of Lagrangian dual problem which has zero duality gap property and develop a kind of SQP method.
本文我们建立了一类具有零对偶间隙性质的Lagrangian对偶问题，并且提出了一种改进的SQP方法。全文分为三章。 - The corresponding relation between the problem and dual problem determines that the two problems can be transformed between each other by certain rules.
线性规划的原问题与对偶问题的对应关系决定了二者之间可通过一定规则相互转化。 - This paper sets up a dual problem for nondifferentiable convex programming with equality constraints and proves the weak duality and strong duality. The relation of strong duality with Lagrange foctor is discussed.
本文建立带有等式约束的非可微凸规划的新的对偶问题，证明了其弱对偶性及强对偶性，并讨论了强对偶性与Lagrange因子的关系。 - The Mond_Weir duality for generalized vector optimization is dealt with in this paper. This paper proves the theorems on weak duality between primary problem and dual problem, direct duality and inverse duality.
对广义向量最优化问题建立了Mond＿Weir型对偶，证明了原问题和对偶问题之间的弱对偶定理、直接对偶定理和逆对偶定理。 - We establish the model of a class of Lagrangian dual problem under very ordinary conditions and obtain that this Lagrangian dual problem has zero duality gap property.
在一般的假设之下，得出了原问题与对偶问题之间具有零对偶间隙性质的一个充分条件，并得到了几个重要的推论。 - An interior point method for solving surrogate dual problem of quadratic programming
解二次规划代理对偶问题的内点法 - A dual problem of convex problem
C规划问题。凸规划的一个对偶问题 - In this paper we discuss and prove the relationship of the solution to the most two kinds SVM methods: C-SVC and v-SVC, taking advantage of the solution connection between optimal and dual problem and KKT condition.
论文主要是利用最优化理论中的原始问题与对偶问题解的关系和KKT条件，对支持向量机中两类最常用分类方法：v-SVC和C-SVC的解的关系问题进行研究和论证； - A Dual Problem of Linear Programming in Banach Spaces
Banach空间中线性规划的对偶问题 - The paper sets up a new dual problem of a nondifferentiable convex programming problem and proves its dual properties such as weak duality, strong duality and converse duality.
本文对非可微凸规划问题建立了一个新的对偶问题，并证明其对偶性质，如弱对偶性，强对偶性及逆对偶性。 - The basic Support Vector Machine for Classification solves the primal problem by solving the dual problem.
支持向量机是通过求解对偶问题来解决原始问题的。 - In this paper, we set up a new dual problem for nondifferentiable convex programming which is different from well known dual problems and prove the weak duality and the strong duality.
文章建立关于非可微凸规划的一个新的对偶问题，它不同于已知的对偶问题，文中证明了弱对偶性及强对偶性。 - Since the sub-problem is strict convex and separable, the dual problem is especially effective for large scale problem.
由于我们得到的子问题是严格凸和可分的，从而获得的对偶问题简单易解，因此这一方法尤其适合处理大规模问题。 - Discussion on the conversion methods of problem and dual problem in linear programming
线性规划中原问题与对偶问题转化方法探讨 - The Lagrangian dual problem and the optimization conditions of the saddle point play important parts in optimization problem.
Lagrangian对偶问题和鞍点最优性条件又是最优化问题中的重要课题。 - After constructing the primitive problem of triplet support vector machines, the existence and uniqueness of the problem and the relationship with the dual problem are proved.
首先构造出三胞支持向量机的原始问题，接着对它的解的存在唯一性问题及它与对偶问题的关系作了证明，最后进行了实验比较，验证了所提方法的有效性。 - Secondly, the transformation dual problem is solved directly using relaxation method.
其次对于转化后的对偶问题直接采用松弛法进行求解。 - We prove the solution of original problem of the support vector regression machine of based on noise model which is existence and uniqueness, and infer dual problem, also prove the existence of solutions of dual problem.
证明了噪声模型的支持向量回归机原问题解的存在唯一性，并推导原问题的对偶问题。 - To the difficulty of solving for the distributed environment, a new auxiliary variable and additional constraints are introduced, so the original problem is transformed into the dual problem. Each node can independently solve by the iteration.
考虑到分布式环境下求解的困难性，通过定义新的辅助变量和引入附加约束条件，把原始问题转化为易求解的对偶问题，使得每个节点可独立地利用迭代法求最优解。 - Objective of the demolition of the market situation and problems of analysis and found that the work of house demolition in the system level and implementation level of the dual problem.
客观地对我国拆迁市场的现状和存在的问题进行分析，发现我国城市房屋拆迁工作在制度层面和实施层面的双重问题。 - The sub-gradient algorithm is designed to solve lagrangian dual problem according to its characteristic.
根据问题的特性设计了次梯度算法求解拉格朗日对偶问题。